Dynamic Flow Scheduling With Uncertain Flow Duration in Optical Data Centers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information-Agnostic Flow Scheduling for Commodity Data Centers

Many existing data center network (DCN) flow scheduling schemes minimize flow completion times (FCT) based on prior knowledge of flows and custom switch functions, making them superior in performance but hard to use in practice. By contrast, we seek to minimize FCT with no prior knowledge and existing commodity switch hardware. To this end, we present PIAS1, a DCN flow scheduling mechanism that...

متن کامل

Uncertain Dynamic Network Flow Problems

In this paper, uncertain dynamic network flow problems (UDNFPs) are formulated, and an algorithm is proposed to solve them by noting that arc capacities are uncertain (may vary with time or not), and flow varies over time in each arc. Here, uncertainty refers to nondeterministic states, in which some factors are uncertain and cannot be determined by the probability theory. Since the uncertainty...

متن کامل

Flow - based Dynamic Routing In Uncertain Network

Acknowledgments This dissertation summarizes my work in the last few years at UT Austin. Without the help from many people this work would not have been possible. First of all, I would like to express my deepest gratitude to my adviser, Dr. Gustavo de Veciana, who has guided my way over the years. He has shown me by example what it means to be a scholar, a teacher and a professional. I would al...

متن کامل

Flow Scheduling in Optical Flow Switching Networks Under Transient Conditions

We study flow scheduling to lightpaths in an optical flow switching network where flow arrivals are modeled as a time dependent Poisson process and their holding times are Pareto distributed. Scheduling decisions are taken at fixed time intervals (larger than 100 ms) in a central node and scheduled flows cannot be interrupted before their completion. The scheduling problem is represented as a d...

متن کامل

A Genetic Regulatory Network-Based Method for Dynamic Hybrid Flow Shop Scheduling with Uncertain Processing Times

The hybrid flow shop is a typical discrete manufacturing system. A novel method is proposed to solve the shop scheduling problem featured with uncertain processing times. The rolling horizon strategy is adopted to evaluate the difference between a predictive plan and the actual production process in terms of job delivery time. The genetic regulatory network-based rescheduling algorithm revises ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2017

ISSN: 2169-3536

DOI: 10.1109/access.2017.2716345